Defining and Detecting Emergence in Complex Networks

نویسندگان

  • Fabio Boschetti
  • Mikhail Prokopenko
  • Ian Macreadie
  • Anne-Marie Grisogono
چکیده

Emergence is seen as the most significant feature discriminating “complex” from “non complex” systems. Nevertheless, no standard definition of emergence is currently available in the literature. This lack of a shared view affects the development of tools to detect and model emergence for both scientific and engineering applications. Here we review some definitions of emergence with the aim to describe how they can be implemented in algorithms to detect and model emergence in sensor and communication

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronization analysis of complex dynamical networks with hybrid coupling with application to Chua’s circuit

Complex dynamic networks have been considered by researchers for their applications in modeling and analyzing many engineering issues. These networks are composed of interconnected nodes and exhibit complex behaviors that are resulted from interactions between these nodes. Synchronization, which is the concept of coordinated behavior between nodes, is the most interested behavior in these netwo...

متن کامل

Is Anything Ever New? Considering Emergence

This brief essay reviews an approach to defining and then detecting the emergence of complexity in nonlinear processes. It is, in fact, a synopsis of Reference [1] that leaves out the technical details in an attempt to clarify the motivations behind the approach. The central puzzle addressed is how we as scientists — or, for that matter, how adaptive agents evolving in populations — ever “disco...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Detecting Bot Networks Based On HTTP And TLS Traffic Analysis

Abstract— Bot networks are a serious threat to cyber security, whose destructive behavior affects network performance directly. Detecting of infected HTTP communications is a big challenge because infected HTTP connections are clearly merged with other types of HTTP traffic. Cybercriminals prefer to use the web as a communication environment to launch application layer attacks and secretly enga...

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005